Ideal Threshold Schemes from MDS Codes
نویسندگان
چکیده
We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.
منابع مشابه
Revisiting the Karnin, Greene and Hellman Bounds
The algebraic setting for threshold secret sharing scheme can vary, dependent on the application. This algebraic setting can limit the number of participants of an ideal secret sharing scheme. Thus it is important to know for which thresholds one could utilize an ideal threshold sharing scheme and for which thresholds one would have to use nonideal schemes. The implication is that more than one...
متن کاملLinear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملQuantum Secret Sharing Schemes
Nascimento et al. [19] introduced a quantum information theoretical model for Quantum Secret Sharing (QSS) schemes. In this thesis, we describe existing schemes, such as the construction using Monotone Span Programs (MSPs) [16], according to this model. Moreover, the correctness of these schemes is proved in an information theoretical way. In particular, we consider the so-called pure state QSS...
متن کاملMDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves
For a secret sharing scheme, two parameters dmin and dcheat are defined in [12] and [13]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [12],[9] and [13]. The MDS secretsharing scheme was defined in [13] and it was proved that MDS perfe...
متن کاملSystems of MDS codes from units and idempotents
Algebraic systems are constructed from which series of maximum distance separable (mds) codes are derived. The methods use unit and idempotent schemes.
متن کامل